Quasiconvex Duality Theorems with Quasiconjugates and Generator
نویسندگان
چکیده
This paper is based on the author’s thesis, “On duality theorems for quasiconvex programming”. In this paper, we investigate duality theorems for quasiconvex programming as generalizations of results in convex programming, and consists of three topics. The first topic is about quasiconjugates and polar sets. The second is about three types of set containment characterizations. The third is about constraint qualifications for Lagrange-type duality theorem in quasiconvex programming.
منابع مشابه
Surrogate duality for robust optimization
Robust optimization problems, which have uncertain data, are considered. We prove surrogate duality theorems for robust quasiconvex optimization problems and surrogate min-max duality theorems for robust convex optimization problems. We give necessary and sufficient constraint qualifications for surrogate duality and surrogate min-max duality, and show some examples at which such duality result...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملChapter 6 GENERALIZED CONVEX DUALITY AND ITS ECONOMIC APPLICATIONS *
This article presents an approach to generalized convex duality theory based on Fenchel-Moreau conjugations; in particular, it discusses quasiconvex conjugation and duality in detail. It also describes the related topic of microeconomics duality and analyzes the monotonicity of demand functions.
متن کاملOn Set Containment Characterization and Constraint Qualification for Quasiconvex Programming
Dual characterizations of the containment of a convex set with quasiconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.
متن کاملFixed Point Theorems for Nonconvex Valued Correspondences and Applications in Game Theory
In this paper, we introduce several types of correspondences: weakly naturally quasiconvex, *-weakly naturally quasiconvex, weakly biconvex and correspondences with *–weakly convex graph and we prove some fixed point theorems for these kinds of correspondences. As a consequence, using a version of W.K. Kim’s quasi-point theorem, we obtain the existence of equilibria for a quasi-game.
متن کامل